The Dual Round Robin Pseudo-grant Matching for high-speed packet Switches

The Virtual Output Queueing (VoQ) in conjunction with matching algorithms have been proposed to overcome the HOL problem in input queued (IQ) high-speed switches. The Dual Round-Robin Matching (DRRM) scheme, has been shown to achieve good performance while being easy to build to high-speed and scalable switches. In this paper, we present a variant and improved version of the DRRM scheme, termed the Pseudogrant Dual Round-Robin Matching (PDRRM) algorithm. The PDRRM gives a Pseudo-grant to a needy input to increase the number of matches per time slot. We have evaluated the PDRRM using extensive simulations. Our results will demonstrate that using the “Pseudo-grant” concept results in significant improvement in the performance of DRRM under different networking scenarios. In addition, PDRRM is conjectured to achieve an asymptotic 100% throughput for any arrival pattern.